/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-04-24
 * Time: 9:32
 */
//1745.回文串分割IV
class Solution3 {
    public boolean checkPartitioning(String s) {
        int n = s.length();
        boolean[][] dp= new boolean[n][n];

        for(int i = n-1; i >= 0; i--) {
            for(int j = i; j < n; j++) {
                if(s.charAt(i) == s.charAt(j)) {
                    dp[i][j] = i+1 < j ? dp[i+1][j-1] : true;
                }
            }
        }
        for(int i = 1; i < n-1; i++) {
            for(int j = i; j < n-1; j++) {
                if(dp[0][i-1] && dp[i][j] && dp[j+1][n-1]) {
                    return true;
                }
            }
        }
        return false;
    }
}
